A Proof-Theoretic Approach to the Static Analysis of Logic Programs
نویسندگان
چکیده
Dedicated to Peter Andrews on the occasion of his 70 th birthday.
منابع مشابه
Subject Reduction of Logic Programs as Proof-Theoretic Property
We consider prescriptive type systems for logic programs (as in Gödel or Mercury). In such systems, the typing is static, but it guarantees an operational property: if a program is “well-typed”, then all derivations starting in a “well-typed” query are again “well-typed”. This property has been called subject reduction. We show that this property can also be phrased as a property of the proof-t...
متن کاملA Proof Theoretic Approach to Failure in Functional Logic Programming
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic perspective. The starting point of our work is CRWL (Constructor based ReWriting Logic), a well established theoretical framework for functional logic programming, whose fundamental notion is that of non-strict non-determ...
متن کاملTowards a Logic for Reasoning About Logic Programs Transformation
We give a proof-theoretic analysis of logic programs transformations , viewed as operations on proof trees in the sense of 3, 4, 9, 10]. We present a logic for reasoning about (equivalence preserving) transformations of logic programs. Our main tool is the usage of inference rules; the target program may be obtained as a set of clause introduction proofs with axioms from the source program. The...
متن کاملInductive Fixpoints in Higher Order Logic
We show that an analogue of the domain-theoretic least fixpoint operator can be defined in a purely set-theoretic framework. It can be formalized in classical higher order logic, serving as a solid foundation for proving termination of (possibly nested) recursive programs in a variety of mechanized proof systems.
متن کاملTowards a Description Logic for Program Analysis: Extending ALCQIO with Reachability
Shape analysis attempts to analyze and verify correctness of programs with dynamic data structures. This is a notoriously difficult task, because it necessitates efficient decision procedures for expressive logics on graphs and graph-like structures. In the last decade, model-theoretic approaches have been less prominent , and the leading approach is proof-theoretic [15]. Recent advances in fin...
متن کامل